Ridge Functions, Sigmoidal Functions and Neural Networks

نویسنده

  • Will Light
چکیده

This paper considers mainly approximation by ridge functions. Fix a point a 2 IR n and a function g : IR ! IR. Then the function f : IR n ! IR deened by f (x) = g(ax), x 2 IR n , is a ridge or plane wave function. A sigmoidal function is a particular example of the function g which closely resembles 1 at 1 and 0 at ?1. This paper discusses approximation problems involving general ridge functions and speciic research connected with sigmoidal functions. The type of problems discussed lead naturally to a consideration of neural networks, particularly multi-layered feedforward networks. Most important is the existence of constructive proofs of the fact that networks of this type can approximate a given continuous function to any desired accuracy. A mathematician's view of these networks may be found in Section 5.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximation by Ridge Functions and Neural Networks

We investigate the efficiency of approximation by linear combinations of ridge functions in the metric of L2(B ) with Bd the unit ball in Rd. If Xn is an n-dimensional linear space of univariate functions in L2(I), I = [−1, 1], and Ω is a subset of the unit sphere Sd−1 in Rd of cardinality m, then the space Yn := span{r(x · ξ) : r ∈ Xn, ω ∈ Ω} is a linear space of ridge functions of dimension ≤...

متن کامل

Some Approximation Properties of Projection Pursuit Learning Networks

This paper will address an important question in machine learning: What kind of network architectures work better on what kind of problems? A projection pursuit learning network has a very similar structure to a one hidden layer sigmoidal neural network. A general method based on a continuous version of projection pursuit regression is developed to show that projection pursuit regression works ...

متن کامل

Computing Time Lower Bounds for Recurrent Sigmoidal Neural Networks

Recurrent neural networks of analog units are computers for realvalued functions. We study the time complexity of real computation in general recurrent neural networks. These have sigmoidal, linear, and product units of unlimited order as nodes and no restrictions on the weights. For networks operating in discrete time, we exhibit a family of functions with arbitrarily high complexity, and we d...

متن کامل

Lower Bounds for Approximation of Some Classes of Lebesgue Measurable Functions by Sigmoidal Neural Networks

We propose a general method for estimating the distance between a compact subspace K of the space L([0, 1]) of Lebesgue measurable functions defined on the hypercube [0, 1], and the class of functions computed by artificial neural networks using a single hidden layer, each unit evaluating a sigmoidal activation function. Our lower bounds are stated in terms of an invariant that measures the osc...

متن کامل

Ridgelets: Estimating with Ridge Functions

Feedforward neural networks, projection pursuit regression, and more generally, estimation via ridge functions have been proposed as an approach to bypass the curse of dimensionality and are now becoming widely applied to approximation or prediction in applied sciences. To address problems inherent to these methods – ranging from the construction of neural networks to their efficiency and capab...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993